Optimal Schemes for Discrete Distribution Estimation Under Locally Differential Privacy
نویسندگان
چکیده
منابع مشابه
Discrete Distribution Estimation under Local Privacy
As argued in the proof sketch of Theorem 2, it suffices to show that r ,ε,k,n (Q) obeys the data processing inequality. is the minimax risk in the non-private setting.
متن کاملDiscrete Distribution Estimation under Local Privacy
The collection and analysis of user data drives improvements in the app and web ecosystems, but comes with risks to privacy. This paper examines discrete distribution estimation under local privacy, a setting wherein service providers can learn the distribution of a categorical statistic of interest without collecting the underlying data. We present new mechanisms, including hashed k-ary Random...
متن کاملDiscrete Distribution Estimation under Local Privacy
The collection and analysis of user data drives improvements in the app and web ecosystems, but comes with risks to privacy. This paper examines discrete distribution estimation under local privacy, a setting wherein service providers can learn the distribution of a categorical statistic of interest without collecting the underlying data. We present new mechanisms, including hashed k-ary Random...
متن کاملCommunication Efficient, Sample Optimal, Linear Time Locally Private Discrete Distribution Estimation
We consider discrete distribution estimation over k elements under ε-local differential privacy from n samples. The samples are distributed across users who send privatized versions of their sample to the server. All previously known sample optimal algorithms require linear (in k) communication complexity in the high privacy regime (ε < 1), and have a running time that grows as n · k, which can...
متن کاملLocally exact modifications of discrete gradient schemes
Locally exact integrators preserve linearization of the original system at every point. We construct energy-preserving locally exact discrete gradient schemes for arbitrary multidimensional canonical Hamiltonian systems by modifying classical discrete gradient schemes. Modifications of this kind are found for any discrete gradient. PACS Numbers: 45.10.-b; 02.60.Cb; 02.70.-c; 02.70.Bf MSC 2000: ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2809790